Distances Between Phylogenetic Trees: A Survey
نویسندگان
چکیده
Phylogenetic trees have been widely used in the study of evolutionary biology for representing the tree-like evolution of a collection of species. However, different data sets and different methods often lead to the construction of different phylogenetic trees for the same set of species. Therefore, comparing these trees to determine similarities or, equivalently, dissimilarities, becomes the fundamental issue. Typically, Tree Bisection and Reconnection (TBR) and Subtree Prune and Regraft (SPR) distances have been proposed to facilitate the comparison between different phylogenetic trees. In this paper, we give a survey on the aspects of computational complexity, fixed-parameter algorithms, and approximation algorithms for computing the TBR and SPR distances of phylogenetic trees.
منابع مشابه
Statistical and Combinatorial Aspects of Comparative Genomics*
This document presents a survey of the statistical and combinatorial aspects of four areas of comparative genomics: gene order based measures of evolutionary distances between species, construction of phylogenetic trees, detection of horizontal transfer of genes, and detection of ancient whole genome duplications.
متن کاملReconstruction of certain phylogenetic networks from their tree-average distances.
Trees are commonly utilized to describe the evolutionary history of a collection of biological species, in which case the trees are called phylogenetic trees. Often these are reconstructed from data by making use of distances between extant species corresponding to the leaves of the tree. Because of increased recognition of the possibility of hybridization events, more attention is being given ...
متن کاملProbabilistic Distances Between Trees
Most existing measures of distance between phylogenetic trees are based on the geometry or topology of the trees. Instead, we consider distance measures which are based on the underlying probability distributions on genetic sequence data induced by trees. Monte Carlo schemes are necessary to calculate these distances approximately, and we describe efficient sampling procedures. Key features of ...
متن کاملInferring Pedigree Graphs from Genetic Distances
In this paper, we study a problem of inferring blood relationships which satisfy a given matrix of genetic distances between all pairs of n nodes. Blood relationships are represented by our proposed graph class, which is called a pedigree graph. A pedigree graph is a directed acyclic graph in which the maximum indegree is at most two. We show that the number of pedigree graphs which satisfy the...
متن کاملOligo-distance: a Sequence Distance Determined by Word Frequencies
Differences in the frequencies of chemical words of a given length in two nucleic sequences are used to define an “oligo-distance” between the sequences. Oligo-distances are much easier and faster to compute than the distances conventionally determined by sequence alignment. A correlation between oligo-distance and alignment-distance is observed. The two kinds of distances are used to construct...
متن کامل